Role Hierarchies and Number Restrictions

نویسندگان

  • Hans Jürgen Ohlbach
  • Jana Koehler
چکیده

We present the atomic decomposition technique as a general method for reducing reasoning about cardinalities of sets, in the DL case the cardinalities of role llers, to equation solving problems. Then we apply the technique to a particular description logic with complex role terms and role hierarchies and a strong arithmetic component.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Expressive ABox Reasoning with Number Restrictions, Role Hierarchies, and Transitively Closed Roles

We present a new tableaux calculus deciding the ABox consistency problem for the expressive description logic ALCNHR+ . Prominent language features of ALCNHR+ are number restrictions, role hierarchies, transitively closed roles, and generalized concept inclusions. The ABox description logic system RACE is based on the calculus for ALCNHR+ .

متن کامل

Reasoning with Very Expressive Fuzzy Description Logics

It is widely recognized today that the management of imprecision and vagueness will yield more intelligent and realistic knowledge-based applications. Description Logics (DLs) are a family of knowledge representation languages that have gained considerable attention the last decade, mainly due to their decidability and the existence of empirically high performance of reasoning algorithms. In th...

متن کامل

Practical Reasoning for Description Logics with Functional Restrictions, Inverse and Transitive Roles, and Role Hierarchies

Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can be computationally problematical. We present an algorithm that decides satisfiability of the DL ALC extended with transitive and inverse roles, role hierarc...

متن کامل

Complexity Analysis and Variational Inference for Interpretation-based Probabilistic Description Logic

This paper presents complexity analysis and variational methods for inference in probabilistic description logics featuring Boolean operators, quantification, qualified number restrictions, nominals, inverse roles and role hierarchies. Inference is shown to be PEXP-complete, and variational methods are designed so as to exploit logical inference whenever possible.

متن کامل

Practical reasoning with qualified number restrictions: A hybrid Abox calculus for the description logic H

This article presents a hybrid Abox tableau calculus for SHQ which extends the basic description logic ALC with role hierarchies, transitive roles, and qualified number restrictions. The prominent feature of our hybrid calculus is that it reduces reasoning about qualified number restrictions to integer linear programming. The calculus decides SHQ Abox consistency w.r.t. a Tbox containing genera...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997